Ramanujan subspace pursuit for signal periodic decomposition
نویسندگان
چکیده
منابع مشابه
Ramanujan subspace pursuit for signal periodic decomposition
The period estimation and periodic decomposition of a signal are the long-standing problems in the field of signal processing and biomolecular sequence analysis. To address such problems, we introduce the Ramanujan subspace pursuit (RSP) based on the Ramanujan subspace. As a greedy iterative algorithm, the RSP can uniquely decompose any signal into a sum of exactly periodic components, by selec...
متن کاملOrthogonal, exactly periodic subspace decomposition
The detection and estimation of machine vibration multiperiodic signals of unknown periods in white Gaussian noise is investigated. New estimates for the subsignals (signals making up the received signal) and their periods are derived using an orthogonal subspace decomposition approach. The concept of exactly periodic signals is introduced. This in turn simplifies and enhances the understanding...
متن کاملSparse signal decomposition for periodic signal mixtures
Periodicities are found in speech signals, musical rhythms, biomedical signals and machine vibrations. In many signal processing applications, signals are assumed to be periodic or quasi-periodic. Especially in acoustic signal processing, signal models based on periodicities have been studied for speech and audio processing. The sinusoidal modelling has been proposed to transform an acoustic si...
متن کاملHighly Scalable Matching Pursuit Signal Decomposition Algorithm
Matching Pursuit Decomposition (MPD) is a powerful iterative algorithm for signal decomposition and feature extraction. MPD decomposes any signal into linear combinations of its dictionary elements or “atoms”. A best fit atom from an arbitrarily defined dictionary is determined through cross-correlation. The selected atom is subtracted from the signal and this procedure is repeated on the resid...
متن کاملMatching Pursuit with Asymmetric Functions for Signal Decomposition and Parameterization
The method of adaptive approximations by Matching Pursuit makes it possible to decompose signals into basic components (called atoms). The approach relies on fitting, in an iterative way, functions from a large predefined set (called dictionary) to an analyzed signal. Usually, symmetric functions coming from the Gabor family (sine modulated Gaussian) are used. However Gabor functions may not be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mechanical Systems and Signal Processing
سال: 2017
ISSN: 0888-3270
DOI: 10.1016/j.ymssp.2016.12.020